Topological Forcing Semantics with Settling
نویسنده
چکیده
The semantics introduced in [3] is extended to all topological spaces.
منابع مشابه
Functorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملWhat’s behind meaning?
The paper addresses the main questions to be dealt with by any semantic theory which is committed to provide an explanation of how meaning is possible. On one side the paper argues that the resources provided by the development of mathematical logic, theoretical computer science, cognitive psychology, and general linguistics in the 20th Century, however indispensable to investigate the structur...
متن کاملThe Proper Forcing Axiom
The Proper Forcing Axiom is a powerful extension of the Baire Category Theorem which has proved highly effective in settling mathematical statements which are independent of ZFC. In contrast to the Continuum Hypothesis, it eliminates a large number of the pathological constructions which can be carried out using additional axioms of set theory. Mathematics Subject Classification (2000). Primary...
متن کاملPii: S0025-3227(00)00044-x
In this paper we describe two sensors for measurement of particle size-distribution and settling-velocity distribution. These measurements are critical to the correct estimation of the true sediment concentration in the ®eld, as well as to evaluating models for transport rates of sediments. A multi-angle measurement of laser scattering is made and inverted to obtain the particle size distributi...
متن کاملOn topological models of GLP
We develop topological semantics of a polymodal provability logic GLP. Our main result states that the bimodal fragment of GLP, although incomplete with respect to relational semantics, is topologically complete. The topological (in)completeness of GLP remains an interesting open problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 163 شماره
صفحات -
تاریخ انتشار 2009